Approximation Algorithms for the Interval Constrained Coloring Problem
نویسندگان
چکیده
منابع مشابه
The Interval Constrained 3-Coloring Problem
In this paper, we settle the open complexity status of interval constrained coloring with a fixed number of colors. We prove that the problem is already NP-complete if the number of different colors is 3. Previously, it has only been known that it is NP-complete, if the number of colors is part of the input and that the problem is solvable in polynomial time, if the number of colors is at most ...
متن کاملApproximating the Interval Constrained Coloring Problem
We consider the interval constrained coloring problem, which appears in the interpretation of experimental data in biochemistry. Monitoring hydrogen-deuterium exchange rates via mass spectroscopy experiments is a method used in that field to obtain information about protein tertiary structure. The output of these experiments provides data about the exchange rate of residues in overlapping fragm...
متن کاملApproximation Algorithms for the Max-coloring Problem
Given a graph G = (V,E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . , Ck, minimize ∑k i=1 maxv∈Ciw(v). The problem arises in scheduling conflicting jobs in batches and in minimizing buffer size in dedicated memory managers. In this paper we present three approximation algorithms and one in...
متن کاملOn the approximability of the maximum interval constrained coloring problem
In the Maximum Interval Constrained Coloring problem, we are given a set of intervals on a line and a k-dimensional requirement vector for each interval, specifying how many vertices of each of k colors should appear in the interval. The objective is to color the vertices of the line with k colors so as to maximize the total weight of intervals for which the requirement is satisfied. This NP-ha...
متن کاملImproved Approximation Algorithms for the Max-Edge Coloring Problem
The Max Edge-Coloring (MEC) problem is a natural weighted generalization of the classical edgecoloring problem. Formally, in the MEC problem we are given a graph G = (V,E) with a weight function w : E → N , and we ask for a proper edge-coloring of G, M = {M1,M2, . . . ,Mk}, such that the sum of the weights of the heaviest edges in the color classes, W = ∑k i=1max{w(e)|e ∈ Mi}, is minimized. The...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2010
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-010-9406-0